An Effective Branch-and-cut algorithm in Order to Solve the Mixed Integer Bi-level Programming
نویسندگان
چکیده
منابع مشابه
Branch-and-cut Algorithms for Integer Programming, Branch-and-cut
Branch-and-cut methods are exact algorithms for integer programming problems. They consist of a combination of a cutting plane method with a branch-and-bound algorithm. These methods work by solving a sequence of linear programming relaxations of the integer programming problem. Cutting plane methods improve the relaxation of the problem to more closely approximate the integer programming probl...
متن کاملLearning to Branch in Mixed Integer Programming
The design of strategies for branching in Mixed Integer Programming (MIP) is guided by cycles of parameter tuning and offline experimentation on an extremely heterogeneous testbed, using the average performance. Once devised, these strategies (and their parameter settings) are essentially input-agnostic. To address these issues, we propose a machine learning (ML) framework for variable branchin...
متن کاملA mixed integer bi-level DEA model for bank branch performance evaluation by Stackelberg approach
One of the most complicated decision making problems for managers is the evaluation of bank performance, which involves various criteria. There are many studies about bank efficiency evaluation by network DEA in the literature review. These studies do not focus on multi-level network. Wu (Eur J Oper Res 207:856–864, 2010) proposed a bi-level structure for cost efficiency at the first time. In t...
متن کاملAn Imperialist Competitive Algorithm and a Mixed Integer Programming Formulation for the Capacitated Vehicle Routing Problem
The Vehicle Routing Problem (VRP), a famous problem of operation research, holds a central place in combinatorial optimization problems. In this problem, a fleet vehicles with Q capacity start to move from depot and return after servicing to customers in which visit only ones each customer and load more than its capacity not at all. The objective is to minimize the number of used vehicles and t...
متن کاملAn interactive fuzzy goal programming algorithm to solve decentralized bi-level multiobjective fractional programming problem
This paper proposes a fuzzy goal programming based on Taylor series for solving decentralized bilevel multiobjective fractional programming (DBLMOFP) problem. In the proposed approach, all of the membership functions are associated with the fuzzy goals of each objective at the both levels and also the fractional membership functions are converted to linear functions using the Taylor series appr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Production Management and Engineering
سال: 2017
ISSN: 2340-4876
DOI: 10.4995/ijpme.2017.6512